Linear Explicit Substitutions
نویسندگان
چکیده
The-calculus adds explicit substitutions to the-calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper gen-eralises the-calculus to provide a linear calculus of explicit substitutions , called xDILL, which analogously describes the implementation of linear functional programming languages. Our main observation is that there are non-trivial interactions between linearity and explicit substitutions and that xDILL is therefore best understood as a synthesis of its underlying logical structure and the technology of explicit substitutions. This is in contrast to the-calculus where the explicit substitutions are independent of the underlying logical structure.
منابع مشابه
Linear Explicit Substitutions ( Extended
The -calculus [1] adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper generalises the -calculus to provide a linear calculus of explicit substitutions which analogously describes the implementation of linear functional programming languages.
متن کاملLinear lambda calculus with explicit substitutions as proof-search in Deep Inference
SBV is a deep inference system that extends the set of logical operators of multiplicative linear logic with the non commutative operator seq. We introduce the logical system SBVrwhich extends SBV by adding a self-dual atom-renaming operator to it. We prove that the cut elimination holds on SBVr. SBVr and its cut free subsystem BVr are complete and sound with respect to linear Lambda calculus w...
متن کاملCategorical Models of Explicit Substitutions
This paper concerns itself with the categorical semantics of -calculi extended with explicit substitutions. For the simply-typed -calculus, indexed categories seem to provide the right categorical framework but because these structures are inherently non-linear, alternate models are needed for linear -calculi extended with explicit substitutions. We propose to replace indexed categories by pres...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic,via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [34, 5] is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as λ...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic, via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [30, 29] is strongly normalizing, as well as of all the calculi isomorphic to it such as λυ [24], λs [19], λd [21], and λf [11]. In o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 8 شماره
صفحات -
تاریخ انتشار 2000